public class MinPathSum {
    // leetcode 最小路径和
    // https://leetcode.cn/problems/minimum-path-sum/description/?envType=study-plan-v2&envId=top-100-liked
    public int minPathSum(int[][] grid) {
        int m = grid.length, n = grid[0].length;
        int[][] dp = new int[m+1][n+1];
        int INF = 0x3f3f3f3f;
        for (int i = 0; i <= m; i++) {
            dp[i][0] = INF;
        }
        for (int j = 2; j <= n; j++) {
            dp[0][j] = INF;
        }
        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                dp[i][j] = Math.min(dp[i-1][j], dp[i][j-1]) + grid[i-1][j-1];
            }
        }
        return dp[m][n];
    }
}
